Career Paths with a Two-Body Problem: Occupational Specialization and Geographic Mobility

The Career Paths Less (or More) Traveled: A Sequence Analysis of IT Career Histories, Mobility Patterns, and Career Success

Proportion of Jobs IT Careers F(2, 170) Technical IT Career Late Entry IT Career Managerial IT Career IT Jobs I 72.3% 34.5% 38.0% 112.15*** M 26.4% 219.72*** Non-IT Jobs G 0.9% 5.4% 2.3% 10.52*** P 1.6% 13.9% 5.1% 20.76*** C 2.1% 7.4% 3.7% 7.02*** J 1.6% 3.2% 2.3% 0.69 O 2.6% 9.7% 4.0% 11.90*** S 1.4% 3.5% 1.1% 3.68* T 0.1% 3.1% 0.8% 13.02*** Out of Civilian Workforce U 0.9% 0.3% 0.1% 2.34 X 14...

Interregion-Occupational Persistence and Dispersion: A Model of Geographic and Occupational Mobility

This paper represents the first attempt to develop a set of loglinear models that synthesize gravity models of interregional mobility and loglinear models of occupational mobility. The development of the model is progressed from a simple two-way mobility table analysis to a three-way analysis that controls for one aspect of mobility while investigating another and eventually to a four-way analy...

The Two Paths Problem

Given an undirected graph G = (V,E) and vertices slytl;s2,t2 , the problem is to determine whether or not G admits two vertex disjoint paths Pl and P2 ) connecting sl with tl and s2 with t2 respectively. This problem is solved by an O(n.m) algorithm (n = IV1 , m = IEI) , An important by-product of the paper is a theorem that states that if G is )+-connected and non-planar, then such paths pl an...

Postgraduate and career: Specialization and professional activities

Non-crossing Paths with Geographic Constraints

A geographic network is a graph whose vertices are restricted to lie in a prescribed region in the plane. In this paper we begin to study the following fundamental problem for geographic networks: can a given geographic network be drawn without crossings? We focus on the seemingly simple setting where each region is a unit length vertical segment, and one wants to connect pairs of segments with...